A note on the probability of cutting a Galton-Watson tree
نویسنده
چکیده
The structure of Galton-Watson trees conditioned to be of a given size is wellunderstood. We provide yet another embedding theorem that permits us to obtain asymptotic probabilities of events that are determined by what happens near the root of these trees. As an example, we derive the probability that a Galton-Watson tree is cut when each node is independently removed with probability p, where by cutting a tree we mean that every path from root to leaf must have at least one removed node.
منابع مشابه
A Note on Conditioned Galton-watson Trees
We give a necessary and sufficient condition for the convergence in distribution of a conditioned Galton-Watson tree to Kesten’s tree. This yields elementary proofs of Kesten’s result as well as other known results on local limit of conditioned Galton-Watson trees. We then apply this condition to get new results, in the critical and sub-critical cases, on the limit in distribution of a Galton-W...
متن کاملBranching Processes and Applications
These are notes of a talk given at the probability student seminar in the Weizmann institute of science on September 2011. After introducing Galton-Watson branching process, we consider conditions for which the process survives forever and for which it has a binary tree as a subtree with the same root. As an application, Mandelbrot’s fractal percolation model is discussed.
متن کاملLocal limits of Galton-Watson trees conditioned on the number of protected nodes
We consider a marking procedure of the vertices of a tree where each vertex is marked independently from the others with a probability that depends only on its out-degree. We prove that a critical Galton-Watson tree conditioned on having a large number of marked vertices converges in distribution to the associated sizebiased tree. We then apply this result to give the limit in distribution of a...
متن کاملTree-valued Markov Chains Derived from Galton-watson Processes
Let G be a Galton-Watson tree, and for 0 u 1 let Gu be the subtree of G obtained by retaining each edge with probability u. We study the tree-valued Markov process (Gu; 0 u 1) and an analogous process (G u; 0 u 1) in which G 1 is a critical or subcritical Galton-Watson tree conditioned to be in nite. Results simplify and are further developed in the special case of Poisson( ) o spring distribut...
متن کاملSurvival Probabilities for N -ary Subtrees on a Galton-Watson Family Tree
The family tree of a Galton-Watson branching process may contain N -ary subtrees, i.e. subtrees whose vertices have at least N ≥ 1 children. For family trees without infinite N -ary subtrees, we study how fast N -ary subtrees of height t disappear as t → ∞.
متن کامل